Solution to Solid Wood Board Cutting Stock Problem

نویسندگان

چکیده

In the production process for wooden furniture, raw material costs account more than 50% of furniture costs, and utilization rate materials depends mainly on layout scheme. Therefore, a reasonable is an important measure to reduce costs. This paper investigates solid wood board cutting stock problem (CSP) establishes optimization model, with goal highest possible original boards. An ant colony-immune genetic algorithm (AC­IGA) designed solve this model. The solutions colony are used as initial population immune algorithm, optimal solution obtained using after multiple iterations transformed into accumulation global pheromones, which improves search ability ensures quality. abstracted construction solution. At same time, in order prevent premature convergence, several improved methods, such pheromone hybrid update adaptive crossover probability, proposed. Comparative experiments verify feasibility effectiveness AC­IGA, experimental results show that AC­IGA has better precision compared (ACA), (GA), grey wolf optimizer (GWO), polar bear (PBO). increased by 2.308%, provides effective theoretical methodological support enterprises improve economic benefits.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Study on One-Dimensional Wood Board Cutting Stock Problem Based on Adaptive Genetic Algorithm

When making wood board production, defects on board will influence the machining process automation degree. Therefore, how to fast, accurately remove of wood defects and realize optimal combination cutting stock problem has always been a research hotspot in the field of wood processing. According to the decayed wood board, the paper designed the one dimensional optimization cutting stock combin...

متن کامل

A Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem a Near-optimal Solution to a Two-dimensional Cutting Stock Problem

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a r...

متن کامل

A Genetic Solution for the Cutting Stock Problem

The cutting stock problem it is of great interest in relation with several real world problems. Basically it means that there are some smaller pieces that have to be cut from a greater stock piece, in such a way, that the remaining part of the stock piece should be minimal. The classical solution methods of this problem generally need a great amount of calculation. In order to reduce the comput...

متن کامل

Cutting stock problems and solution procedures

This paper discusses some of the basic formulation issues and solution procedures for solving oneand twodimensional cutting stock problems. Linear programming, sequential heuristic and hybrid solution procedures are described. For two-dimensional cutting stock problems with rectangular shapes, we also propose an approach for solving large problems with limits on the number of times an ordered s...

متن کامل

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical N P-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11177790